The Picard-HSS-SOR iteration method for absolute value equations

The Picard-HSS iteration method for absolute value equations

Recently Bai and Yang in [On HSS-based iteration methods for weakly nonlinear systems, Appl. Numer. Math. 59 (2009) 2923–2936.] proposed the Picard-HSS iteration method to solve the system of nonlinear equations Ax = φ(x), where A ∈ Cn×n is a nonHermitian positive definite matrix and φ : D ⊂ C → C is continuously differentiable function defined on the open complex domain D in the n-dimensional ...

A Generalized HSS Iteration Method for Continuous Sylvester Equations

Based on the Hermitian and skew-Hermitian splitting (HSS) iteration technique, we establish a generalized HSS (GHSS) iteration method for solving large sparse continuous Sylvester equations with non-Hermitian and positive definite/semidefinite matrices. The GHSS method is essentially a four-parameter iteration which not only covers the standard HSS iteration but also enables us to optimize the ...

Two Cscs-based Iteration Methods for Solving Absolute Value Equations∗

Recently, two families of HSS-based iteration methods are constructed for solving the system of absolute value equations (AVEs), which is a class of non-differentiable NP-hard problems. In this study, we establish the Picard-CSCS iteration method and the nonlinear CSCS-like iteration method for AVEs involving the Toeplitz matrix. Then, we analyze the convergence of the Picard-CSCS iteration met...

The variational iteration method for a class of tenth-order boundary value differential equations

Regularized HSS Iteration Method for Saddle - Point Linear Systems

We propose a class of regularized Hermitian and skew-Hermitian splitting methods for the solution of large, sparse linear systems in saddle-point form. These methods can be used as stationary iterative solvers or as preconditioners for Krylov subspace methods. We establish unconditional convergence of the stationary iterations and we examine the spectral properties of the corresponding precondi...